11![On Derandomization and Average-Case Complexity of Monotone Functions ∗ George Karakostas † On Derandomization and Average-Case Complexity of Monotone Functions ∗ George Karakostas †](https://www.pdfsearch.io/img/eee802b7441c1f136d24471b62ae8893.jpg) | Add to Reading ListSource URL: www.cas.mcmaster.caLanguage: English - Date: 2013-12-01 18:41:47
|
---|
12![ALIQUOT SEQUENCES WITH SMALL STARTING VALUES Wieb Bosma Abstract. We describe the results of the computation of aliquot sequences with small starting values. In particular all sequences with starting values less than a ALIQUOT SEQUENCES WITH SMALL STARTING VALUES Wieb Bosma Abstract. We describe the results of the computation of aliquot sequences with small starting values. In particular all sequences with starting values less than a](https://www.pdfsearch.io/img/218a7f681e7e64a5193c19438179b399.jpg) | Add to Reading ListSource URL: www.math.ru.nlLanguage: English - Date: 2014-12-24 08:06:00
|
---|
13![Geocontinua I Lecture Notes Lorenzo Colli February 26, 2014
ii Geocontinua I Lecture Notes Lorenzo Colli February 26, 2014
ii](https://www.pdfsearch.io/img/5e2b4b4987a53373e1a5c4c73111f729.jpg) | Add to Reading ListSource URL: www.geophysik.uni-muenchen.deLanguage: English - Date: 2014-02-26 04:04:02
|
---|
14![Chapter 1 Introduction Let f be Boolean function from
nite binary strings to the set f0; 1g. The basic question of complexity theory is what computational resources are needed to compute f (x) for an arbitrary n-bit str Chapter 1 Introduction Let f be Boolean function from
nite binary strings to the set f0; 1g. The basic question of complexity theory is what computational resources are needed to compute f (x) for an arbitrary n-bit str](https://www.pdfsearch.io/img/10029dc0736cfa86bb8d059e91b29b6b.jpg) | Add to Reading ListSource URL: www.nada.kth.seLanguage: English - Date: 2011-01-05 06:16:54
|
---|
15![QUASIRANDOM GROUPS W. T. Gowers Abstract. Babai and Sos have asked whether there exists a constant c > 0 such that every finite group G has a product-free subset of size at least c|G|: that is, a subset X that does not c QUASIRANDOM GROUPS W. T. Gowers Abstract. Babai and Sos have asked whether there exists a constant c > 0 such that every finite group G has a product-free subset of size at least c|G|: that is, a subset X that does not c](https://www.pdfsearch.io/img/2fa38bedf9ad1504406a44fd904e85b9.jpg) | Add to Reading ListSource URL: www.dpmms.cam.ac.ukLanguage: English - Date: 2006-10-22 13:27:46
|
---|
16![SUBSEQUENCES OF AUTOMATIC SEQUENCES INDEXED BY ⌊nc ⌋ AND CORRELATIONS JEAN-MARC DESHOUILLERS, MICHAEL DRMOTA, AND JOHANNES F. MORGENBESSER Abstract. The main goal of this paper is to study the behavior of subsequence SUBSEQUENCES OF AUTOMATIC SEQUENCES INDEXED BY ⌊nc ⌋ AND CORRELATIONS JEAN-MARC DESHOUILLERS, MICHAEL DRMOTA, AND JOHANNES F. MORGENBESSER Abstract. The main goal of this paper is to study the behavior of subsequence](https://www.pdfsearch.io/img/36b7140799c4b88e7889b324fe7523cd.jpg) | Add to Reading ListSource URL: www.dmg.tuwien.ac.atLanguage: English - Date: 2011-11-25 05:00:23
|
---|
17![Algorithm for decomposition of differences between aggregate demographic measures and its application to life expectancies, healthy life expectancies, parity-progression ratios and total fertility rates Algorithm for decomposition of differences between aggregate demographic measures and its application to life expectancies, healthy life expectancies, parity-progression ratios and total fertility rates](https://www.pdfsearch.io/img/b6ad5897092a57f1be4f3219b0f04e10.jpg) | Add to Reading ListSource URL: www.demographic-research.orgLanguage: English - Date: 2010-03-10 08:28:27
|
---|
18![MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Dynamic Window Decoding for LDPC Convolutional Codes in Low-Latency Optical Communications MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Dynamic Window Decoding for LDPC Convolutional Codes in Low-Latency Optical Communications](https://www.pdfsearch.io/img/6656606b423a8fd4007de9687f28f94a.jpg) | Add to Reading ListSource URL: www.merl.comLanguage: English - Date: 2015-04-17 10:53:52
|
---|
19![The Skein Hash Function Family NIST Round 3 Tweak Description 25 Oct 2010 Description of Changes The only change to the Skein hash function is in the key schedule parity constant, found in Sectionof the newly subm The Skein Hash Function Family NIST Round 3 Tweak Description 25 Oct 2010 Description of Changes The only change to the Skein hash function is in the key schedule parity constant, found in Sectionof the newly subm](https://www.pdfsearch.io/img/f2f89ebf3b9a808a3adee30f328578f9.jpg) | Add to Reading ListSource URL: www.schneier.comLanguage: English - Date: 2014-03-02 23:18:32
|
---|
20![The non-adaptive query complexity of testing k-parities The non-adaptive query complexity of testing k-parities](https://www.pdfsearch.io/img/6d42fe6b623c2f4c365740fc89761846.jpg) | Add to Reading ListSource URL: cjtcs.cs.uchicago.eduLanguage: English - Date: 2013-07-24 10:17:39
|
---|